HYBRID TREES
نویسندگان
چکیده
منابع مشابه
Model Trees for Hybrid Data Type Classification
In the task of classification, most learning methods are suitable only for certain data types. For the hybrid dataset consists of nominal and numeric attributes, to apply the learning algorithms, some attributes must be transformed into the appropriate types. This procedure could damage the nature of dataset. We propose a model tree approach to integrate several characteristically different lea...
متن کاملSemantic Parsing with Relaxed Hybrid Trees
We propose a novel model for parsing natural language sentences into their formal semantic representations. The model is able to perform integrated lexicon acquisition and semantic parsing, mapping each atomic element in a complete semantic representation to a contiguous word sequence in the input sentence in a recursive manner, where certain overlappings amongst such word sequences are allowed...
متن کاملHigh Dimensional Feature Indexing Using Hybrid Trees
Feature based similarity search is emerging as an important search paradigm in database systems. The technique used is to map the data items as points into a high dimensional feature space which is indexed using a multidimensional data structure. Similarity search then corresponds to a range search over the data structure. Traditional multidimensional data structures (e.g., R-tree, KDB-tree, gr...
متن کاملOptimal Independent Spanning Trees on Cartesian Product of Hybrid Graphs
A set of k spanning trees rooted at the same vertex r in a graph G are called independent spanning trees (ISTs) if for any vertex x 6= r, the k paths from v to r, one path in each tree, are internally disjoint. The design of ISTs on graphs has applications to fault-tolerant broadcasting and secure message distribution in networks. It was conjectured that for any k-connected graph there exist k ...
متن کاملPartial Proof Trees, Hybrid Logic, and Quantifier Scope
We argue that a fundamental theoretical difference between the resourcelogical and Minimalist frameworks is the computation of a semantic representation that can capture quantifier scope ambiguity. We discuss an approach to handling such data within the context of a system of categorial inference based on the use of hybrid logic to impose two different levels of composition, and suggest that th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Heredity
سال: 1916
ISSN: 1465-7333,0022-1503
DOI: 10.1093/oxfordjournals.jhered.a110734